Probabilistic Equivalence Checking Using PartialHaar Spectral Diagrams

نویسندگان

  • M. A. Thornton
  • R. Drechsler
چکیده

A probabilistic equivalence checking method is developed based on the use of partial Haar spectral diagrams (HSDs). Partial HSDs are deened and used to represent a subset of Haar spectral coeecients for two Boolean functions. The resulting coeecients are then used to compute and to iteratively reene the probability that two functions are equivalent. This problem has applications in both logic synthesis and veriica-tion. The method described here can be useful for the case where two candidate functions require extreme amounts of memory for a complete BDD representation. Experimental results are provided to validate the eeectiveness of this approach .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Equivalence Checking with Propositional DAGs

The canonical representation of Boolean functions offered by OBDDs (ordered binary decision diagrams) allows to decide the equivalence of two OBDDs in polynomial time with respect to their size. It is still unknown, if this holds for other more succinct supersets of OBDDs such as FBDDs (free binary decision diagrams) and d-DNNFs (deterministic, decomposable negation normal forms), but it is kno...

متن کامل

Probabilistic manipulation of Boolean functions using free Boolean diagrams

We propose a data structure for Boolean functions termed the Free Boolean Diagram. A Free Boolean Diagram allows decision vertices as in the conventional Binary Decision Diagram, but also allows function vertices corresponding to the and and xor functions. It has been shown previously that the equivalence of two Free Boolean Diagrams can be decided probabilistically in polynomial time. Based on...

متن کامل

A Method for Approximate Equivalence Checking

An approximate equivalence checking method is developed based on the use of partial Haar spectral diagrams (HSDs). Partial HSDs are defined and used to represent a subset of the Haar spectral coefficients for two functions. Due to the uniqueness properties of the Haar transform, a necessary condition for equivalence is that the individual coefficients must have the same value. The probability t...

متن کامل

Implementation of Symbolic Model Checking for Probabilistic Systems Progress Report 3 -thesis Proposal Thesis Group Members

In this report, we propose research to be carried out in the area of probabilistic symbolic model checking. Model checking is an automatable technique for the formal veri cation of nite state systems against speci cations given in a temporal logic. A great deal of work has gone into extending the model checking paradigm to the probabilistic setting. This allows veri cation techniques to be deve...

متن کامل

Formal Verification using Probabilistic Techniques

Formal verification is of importance in many phases of the design of digital systems. In spite of the inherent complexity of the problem, the state-of-the-art in the area has been significantly advanced by BDD-based tools. However, the growing complexity of the verification instances keeps motivating the exploration of alternative approaches. This paper considers probabilistic equivalence check...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999